Implementation of Multi-continued Fraction Algorithm and Application to Multi-sequence Linear SynthesisQUANLONG WANG; KUNPENG WANG; ZONGDUO DAI et al.Lecture notes in computer science. 2006, pp 248-258, issn 0302-9743, isbn 3-540-44523-4, 1Vol, 11 p.Conference Paper

Incremental approach to computation of elementary siphons for arbitrary simple sequential processes with resourcesCHAO, D. Y.IET control theory & applications (Print). 2008, Vol 2, Num 2, pp 168-179, issn 1751-8644, 12 p.Article

The Intensional Content of Rice's Theorem (Pearl)ASPERTI, Andrea.ACM SIGPLAN notices. 2008, Vol 43, Num 1, pp 113-119, issn 1523-2867, 7 p.Conference Paper

Polynomial Time Complexity of Edge Colouring Graphs with Bounded Colour ClassesRIZZI, Romeo; CARIOLARO, David.Algorithmica. 2014, Vol 69, Num 3, pp 494-500, issn 0178-4617, 7 p.Article

Linear Complexity of a New Generalized Cyclotomic Sequence of Order Two of Length pqXIAOPING LI; WENPING MA; TONGJIANG YAN et al.IEICE transactions on fundamentals of electronics, communications and computer science. 2013, Vol 96, Num 5, pp 1001-1005, issn 0916-8508, 5 p.Article

New pseudopolynomial complexity bounds for the bounded and other integer Knapsack related problemsTAMIR, Arie.Operations research letters. 2009, Vol 37, Num 5, pp 303-306, issn 0167-6377, 4 p.Article

The use of edge-directions and linear programming to enumerate verticesONN, Shmuel; ROTHBLUM, Uriel G.Journal of combinatorial optimization. 2007, Vol 14, Num 2-3, pp 153-164, issn 1382-6905, 12 p.Conference Paper

New complexity analysis of the primal-dual method for semidefinite optimization based on the Nesterov-Todd directionPENG, J; ROOS, C; TERLAKY, T et al.Journal of optimization theory and applications. 2001, Vol 109, Num 2, pp 327-343, issn 0022-3239Article

Generalized Chat Noir is PSPACE-Complete : New Trends in Algorithms and Theory of ComputationIWAMOTO, Chuzo; MUKAI, Yuta; SUMIDA, Yuichi et al.IEICE transactions on information and systems. 2013, Vol 96, Num 3, pp 502-505, issn 0916-8532, 4 p.Article

Optimal controllability of 3-composed siphons in a class of Petri netsHOU, Y. F; LI, Z. W; HONG, L et al.Electronics letters. 2013, Vol 49, Num 11, pp 697-699, issn 0013-5194, 3 p.Article

QIP = PSPACEJAIN, Rahul; ZHENGFENG JI; UPADHYAY, Sarvagya et al.Communications of the ACM. 2010, Vol 53, Num 12, pp 102-109, issn 0001-0782, 8 p.Article

Self-regular functions and new search directions for linear and semidefinite optimizationJIMING PENG; ROOS, Cornelis; TERLAKY, Tamas et al.Mathematical programming. 2002, Vol 93, Num 1, pp 129-171, issn 0025-5610Article

Long-step homogeneous interior-point algorithm for the P_* -nonlinear complementarity problemsLESAJA, Goran.Yugoslav journal of operations research. 2002, Vol 12, Num 1, pp 17-48, issn 0354-0243, 32 p.Article

POLYNOMIAL TIME-BOUNDED COMPUTATIONS IN SPIKING NEURAL P SYSTEMSSOSÍK, Petr; RODRÍGUEZ-PATÓN, Alfonso; CIENCIALOVAÁ, Lucie et al.Neural Network World (Prague). 2013, Vol 23, Num 1, pp 31-48, issn 1210-0552, 18 p.Conference Paper

An incremental tabu search heuristic for the generalized vehicle routing problem with time windowsMOCCIA, L; CORDEAU, J.-F; LAPORTE, G et al.The Journal of the Operational Research Society. 2012, Vol 63, Num 2, pp 232-244, issn 0160-5682, 13 p.Article

A Simple 2^o(√x) Algorithm for PARTITION and SUBSET SUMO'NEIL, Thomas E; KERLIN, Scott.Foundations of computer science. International conferenceWorldComp'2010. 2010, pp 55-58, isbn 1-60132-142-2, 4 p.Conference Paper

Determining the Positive Definiteness Margin of Interval MatricesKOLEV, Lubomir V.Reliable computing. 2007, Vol 13, Num 6, pp 445-466, issn 1385-3139, 22 p.Article

A note on relatives to the Held and Karp 1-tree problemWESTERLUND, Andreas; GÖTHE-LUNDGREN, Maud; LARSSON, Torbjörn et al.Operations research letters. 2006, Vol 34, Num 3, pp 275-282, issn 0167-6377, 8 p.Article

Presburger modal logic is PSPACE-completeDEMRI, Stéphane; LUGIEZ, Denis.Lecture notes in computer science. 2006, pp 541-556, issn 0302-9743, isbn 3-540-37187-7, 1Vol, 16 p.Conference Paper

Deadlock avoidance in manufacturing systems with a multiple resource request modelJUDD, Robert P; WENLE ZHANG; LIPSET, Robert et al.Proceedings of the American Control Conference. 2002, pp 4443-4448, issn 0743-1619, isbn 0-7803-7298-0, 6Vol, 6 p.Conference Paper

Linear Complexity of Binary Whiteman Generalized Cyclotomic Sequences of Order 4XIAOPING LI; WENPING MA; TONGJIANG YAN et al.IEICE transactions on fundamentals of electronics, communications and computer science. 2013, Vol 96, Num 1, pp 363-366, issn 0916-8508, 4 p.Article

A heuristic for the quay crane scheduling problem based on contiguous bay crane operationsZHIQIANG LU; XIAOLE HAN; LIFENG XI et al.Computers & operations research. 2012, Vol 39, Num 12, pp 2915-2928, issn 0305-0548, 14 p.Article

On the complexity of general matrix scaling and entropy minimization via the RAS algorithmKALANTARI, B; LARI, I; RICCA, F et al.Mathematical programming. 2008, Vol 112, Num 2, pp 371-401, issn 0025-5610, 31 p.Article

A polynomial algorithm for the multicriteria cent-dian location problem : Advances in location analysisCOLEBROOK, Marcos; SICILIA, Joaquin.European journal of operational research. 2007, Vol 179, Num 3, pp 1008-1024, issn 0377-2217, 17 p.Article

A new heuristic for the multi-mode resource investment problemHSU, C-C; KIM, D. S.The Journal of the Operational Research Society. 2005, Vol 56, Num 4, pp 406-413, issn 0160-5682, 8 p.Article